Dickson Bases and Finite Fields

نویسندگان

  • Ronald C. Mullin
  • Ayan Mahalanobis
چکیده

Finite fields have been used for many applications in electronic communications. In the case of extension fields, the nature of computation depends heavily on the choice of basis used to represent the extension over the base field. The most common choices of basis are polynomial bases although optimal normal bases or some variant of these have also been used despite the fact that such bases exist in only a limited set of cases. Building on these, we develop an alternative class of bases that exist for any extension field. We provide hardware models based on the notion of shift registers for computing with respect to such bases, and investigate some of the properties of these models. ∗[email protected][email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reversed Dickson polynomials over finite fields

Reversed Dickson polynomials over finite fields are obtained from Dickson polynomials Dn(x, a) over finite fields by reversing the roles of the indeterminate x and the parameter a. We study reversed Dickson polynomials with emphasis on their permutational properties over finite fields. We show that reversed Dickson permutation polynomials (RDPPs) are closely related to almost perfect nonlinear ...

متن کامل

Factors of Dickson polynomials over finite fields

We give new descriptions of the factors of Dickson polynomials over finite fields.

متن کامل

Generalized reciprocals, factors of Dickson polynomials and generalized cyclotomic polynomials over finite fields

We give new descriptions of the factors of Dickson polynomials over finite fields in terms of cyclotomic factors. To do this generalized reciprocal polynomials are introduced and characterized. We also study the factorization of generalized cyclotomic polynomials and their relationship to the factorization of Dickson polynomials.

متن کامل

Exponential sums with Dickson polynomials

We give new bounds of exponential sums with sequences of iterations of Dickson polynomials over prime finite fields. This result is motivated by possible applications to polynomial generators of pseudorandom numbers. © 2004 Elsevier Inc. All rights reserved.

متن کامل

Revisiting Finite Field Multiplication Using Dickson Bases

Dickson bases have recently been introduced in [1] for finite field arithmetic. Such a basis exists for any extension field and under certain conditions it represents a permutation of type II optimal normal bases. In this paper Dickson bases are developed using simpler mathematical terms and their properties are discussed. An algorithm/architecture based on the model presented in [1] is develop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005